A Proof Theory for Constructive Default Logic
نویسنده
چکیده
We present what we call Constructive Default Logic (CDL) a default logic in which the fixedpoint definition of extensions is replaced by a constructive definition which yield so-called constructive extensions. Selection functions are used to represent explicitly the control of the reasoning process in this default logic. It is well-known that Reiter's original default logic lacks, in general, a default proof theory. We will show that CDL does have a default proof theory, and we will also show that this is related to the fact that CDL has the existence property for constructive extensions and that it also has the semi-monotonicity property. Furthermore, we will also show that, with respect to some counter-examples that were suggested by Lukaszewicz, constructive extensions yield more intuitive conclusions than Reiter’s extensions. Hence, constructive default logic does not only have heuristic advantages over Reiter’s default theory from a computational point of view, but it is also more adequate with respect to knowledge representation. 1 This research was partly supported by the ESPRIT III BRA Project 6156 DRUMS 2.
منابع مشابه
Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملA Proof Theoretical Approach to Default Reasoning I: Tableaux for Default Logic
We present a general proof theoretical methodology for default systems. Given a default theory 〈W, D〉, the default rules D are simply understood as restrictions on the tableaux construction of the logic. Different default approaches have their own way of understanding these restrictions and executing them. For each default approach (such as Reiter, Brewka or Lukaszewicz), the allowable default ...
متن کاملNormal Form Results for Default Logic
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
متن کاملConstraints in Nonmonotonic Reasoning
We report on the use of constraints to govern partial models of rst-order logic. These models are constructed using systems of default rules, as in the default logic of Reiter, but where Reiter's rules build logical theories, our rules build models. Our approach takes advantage of domain-theoretic notions. A system of default rules is a straightforward generalization of Scott's notion of inform...
متن کاملForcing in proof theory
Paul Cohen’s method of forcing, together with Saul Kripke’s related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary ...
متن کامل